A lower bound for the minimum weight of the dual 7-ary code of a projective plane of order 49
نویسندگان
چکیده
Existing bounds on the minimum weight d of the dual 7-ary code of a projective plane of order 49 show that this must be in the range of 75 < d < 99. We use combinatorial arguments to improve this range to 87 < d < 99, noting that the upper bound can be taken to be 91 if the plane has a Baer subplane, as in the desarguesian case. A brief survey of known results for the minimum weight of the dual codes of finite projective planes is also included.
منابع مشابه
An upper bound for the minimum weight of the dual codes of desarguesian planes
We show that a construction described in Clark, Key and de Resmini [9] of small-weight words in the dual codes of finite translation planes can be extended so that it applies to projective and affine desarguesian planes of any order p where p is a prime, and m ≥ 1. This gives words of weight 2p + 1 − p −1 p−1 in the dual of the p-ary code of the desarguesian plane of order p, and provides an im...
متن کاملOn the code generated by the incidence matrix of points and hyperplanes in PG(n, q) and its dual
In this paper, we study the p-ary linear code C(PG(n, q)), q = p, p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n, q) and we exclude all possible codewords arising from small linear blocking sets. We also lo...
متن کاملOn the (dual) code generated by the incidence matrix of points and hyperplanes in PG(n, q)
In this paper, we study the p-ary linear code C(PG(n, q)), q = p, p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n, q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n, q) and we exclude all possible codewords arising from small linear blocking sets. We also lo...
متن کاملDual Codes of Translation Planes
We improve on the known upper bound for the minimum weight of the dual codes of translation planes of certain orders by providing a general construction of words of small weight. We use this construction to suggest a possible formula for the minimum weight of the dual p-ary code of the desarguesian plane of order pm for any prime p and any m ≥ 1.
متن کاملThe construction of self-dual binary codes from projective planes of odd order
Every finite projective plane of odd order has an associated self-dual binary code with parameters (2(q2 + q + q2 + q + 1, We also construct other related self-orthogonal and doubly-even codes, and the vectors of minimum weight. The weight enumerator polynomials for the planes of orders 3 and 5 are found. The boundary and coboundary maps are introduced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 44 شماره
صفحات -
تاریخ انتشار 2007